Open-World Logic Programs: A New Foundation for Formal Specifications
نویسندگان
چکیده
Recent advances in decision procedures and constraint solvers can enable a new generation of formal specification languages. In this paper we present a new semantic foundation for formal specifications, called open-world logic programming, which integrates with state-of-theart solvers. Analysis, verification, and synthesis problems on open-world logic programs can be converted to constraints by a quantifier-elimination scheme using symbolic execution. This paper presents the features, semantics, and algorithms of open-world logic programs. We have implemented this approach in the FORMULA specification language, which has been used for production-quality specifications and models.
منابع مشابه
Towards a Logic-programming System to Debug ASP Knowledge Bases
This paper is a characterisation in terms of Weak Constraints both for Minimal Generalised Answer Sets and Optimal Answer Sets, of an updates semantics that provides a solid foundation for the implementation of a system to debug knowledge bases. The proposed system can be employed both to identify conflicts with upcoming information from a dynamic changing environment, and to locate the source ...
متن کاملSynthesis of Logic Programs from Object-Oriented Formal Specifications
Early validation of requirements is crucial for the rigorous development of software. Without it, even the most formal of the methodologies will produce the wrong outcome. One successful approach, popularised by some of the so-called lightweight formal methods, consists in generating (finite, small) models of the specifications. Another possibility is to build a running prototype from those spe...
متن کاملSeveral Strategies of Reactive System Program Synthesis
Reactive systems, such as operating systems or elevator control systems, are systems that ideally never terminate and are intended to maintain some interaction with their environment. Temporal logic is one of the methods for formal specification descriptions of reactive systems. By describing the formal specifications of reactive systems we can check the consistency of the specifications and wh...
متن کاملFormal Verification of Pure Production System Programs
Reliability, defined as the guarantee that a program satisfies its specifications, is an important aspect of many applications for which rule-based expert systems are suited. Executing rule-based programs on a series of test cases. To show a program is reliable, it is desirable to construct formal specifications for the program and to prove that it obeys those specifications. This paper present...
متن کاملDeterministic Compilation of Temporal Safety Properties in Explicit State Model Checking
The translation of temporal logic specifications constitutes an essential step in model checking and a major influence on the efficiency of formal verification via model checking. We devise a new explicit-state translation of Linear Temporal Logic to automata for the class of LTL specifications that describe safety properties, arguably the most used formal specifications in real-world systems. ...
متن کامل